-
1 complete digraph
Электроника: полный орграф -
2 complete digraph
-
3 complete digraph
The New English-Russian Dictionary of Radio-electronics > complete digraph
-
4 complete digraph
English-Russian dictionary of electronics > complete digraph
-
5 digraph
= directed graph1) ориентированный граф, орграф2) вчт диграф (совокупность двух соседних символов, произносимая как один звук)3) вчт диграмма, биграмма•- acyclic digraphdigraphs equivalent up to conversion — орграфы, эквивалентные относительно обращения
- complete digraph
- connected digraph
- Euler digraph
- Eulerian digraph
- functional digraph
- Hamilton digraph
- Hamiltonian digraph
- iterated line digraphs
- labeled connected digraph
- point-symmetric digraph
- self-converse digraph
- signed digraph
- strongly connected digraph
- transitive digraph
- unilateral digraph
- weakly connected digraph -
6 digraph
сокр. от directed graph1) ориентированный граф, орграф2) вчт. диграф (совокупность двух соседних символов, произносимая как один звук)3) вчт. диграмма, биграмма•- complete digraphdigraphs equivalent up to conversion — орграфы, эквивалентные относительно обращения
- connected digraph
- digraph of graph
- Euler digraph
- Eulerian digraph
- functional digraph
- Hamilton digraph
- Hamiltonian digraph
- iterated line digraphs
- labeled connected digraph
- point-symmetric digraph
- self-converse digraph
- signed digraph
- strongly connected digraph
- transitive digraph
- unilateral digraph
- weakly connected digraphThe New English-Russian Dictionary of Radio-electronics > digraph
-
7 group
1) группа, ансамбль || групповой- roughing mill group2) совокупность; комплект3) группировка || группировать(ся)5) класс; категория || классифицировать; категоризировать6) хим. остаток7) сгусток; скопление8) узел9) матем. группа- absolute free group - absolute homotopy group - absolutely irreducible group - absolutely simple group - additively written group - adele group - adelic group - algebraically compact group - algebraically simple group - almost connected group - almost cyclic group - almost ordered group - almost periodic group - almost simple group - alternating form group - cancellative group - cellular homology group - characteristically simple group - complementing group - completely anisotropic group - completely discontinuous group - completely divisible group - completely indecomposable group - completely integrally closed group - deficient group - direct homology group - direct indecomposable group - doubly transitive group - finitely defined group - finitely generated group - finitely presented group - finitely related group - first homology group - first homotopy group - freely generated group - full linear group - full orthogonal group - full rotation group - full symmetric group - full unimodular group - group of classes of algebras - group of covering transformations - group of finite rank - group of infinite order - group of infinite rank - group of inner automorphisms - group of linear equivalence - group of linear forms - group of linear manifold - group of principal ideles - group of real line - group of recursive permutations - group of right quotients - idele class group - linearly ordered group - linearly transitive group - locally bicompact group - locally closed group - locally compact group - locally connected group - locally cyclic group - locally defined group - locally embeddable group - locally finite group - locally free group - locally infinite group - locally nilpotent group - locally normal group - locally solvable group - multiply primitive group - multiply transitive group - nonsolvable group - n-th homotopy group - ordered pair group - principal congruence group - properly orthogonal group - properly unimodular group - pure projective group - pure rotation group - pure simple group - quasipure projective group - quotient divisible group - residually nilpotent group - restricted holonomy group - sharply transitive group - simply ordered group - simply reducible group - simply transitive group - singular cogomology group - singular homology group - solvable group - stable group - strictly transitive group - strongly polycyclic group - subsolvable group - supersolvable group - totally ordered group - totally projective group - totally reducible group - triply transitive group - unitary symmetry group - unitary transformation group - value group - weak homology group - weakly mixing groupgroup with multiple operators — группа с многоместными операторами, мультиоператорная группа
-
8 extension
1) надставка; насадка2) удлинитель3) выступающая часть, консольная часть4) пристройка5) продление; продолжение6) простирание; протяжённость; распространение7) растяжение; распрямление8) сварка установочная длина9) геод. сгущение сети опорных точек10) расширение; удлинение; добавление; увеличение11) экстенсия, разгибание•extension in space — матем. протяжённость в пространстве
extension by definition — матем. расширение с помощью определений
extension by adjunction — матем. расширение путём присоединения
-
9 component
1) компонент, составная часть; элемент2) деталь; узел; комплектующее изделие3) составляющая, компонента4) ингредиент•
См. также в других словарях:
Digraph (orthography) — For other uses, see Digraph (disambiguation). In Welsh, the digraph ⟨Ll⟩, ⟨ll⟩ fused for a time into a ligature. Further information: list of Latin digraphs and list of Cyrillic digraphs A digraph or digram (from the Greek: δίς dís… … Wikipedia
Digraph (mathematics) — A directed graph or digraph G is an ordered pair G := (V, A) with * V is a set, whose elements are called vertices or nodes, * A is a set of ordered pairs of vertices, called directed edges, arcs, or arrows.It differs from an ordinary, undirected … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Hungarian language — Hungarian magyar Pronunciation [ˈmɒɟɒr] Spoken in … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия